DISCRETE DYNAMIC PROGRAMMING WITH RECURSIVE ADDITIVE SYSTEM
نویسندگان
چکیده
منابع مشابه
Discrete Dynamic Programming
We consider a decision problem taking place over time. In each time period, the single player can take an action by α ∈ A , an action space. All information relevant to the future is incorporated in a state variable y Y ∈ , the state space. The dynamics of y are determined by a transition probability π α ( ’ , ) y y . We define the set of states reachable with some probability under some circum...
متن کاملMulticriteria integer programming: A (hybrid) dynamic programming recursive approach
where C ~ = (ct . . . . . , cpn) t, a n = (atn, . . . , aun) t and k = (k~, k2, .. . , k~) denote vectors of integers, and v-max (vector maximization) is used to differentiate the solution f rom the common single object ive maximization. The solution to (MCILP) is a set of integer points, X ° ( b ) , called efficient, such that if x ° E X ° ( b ) , there does not exist any other feasible point,...
متن کاملRecursive Programming with Proofs
There has been a lot of work based on the paradigm “proofs as programs”, leading to sophisticated realizations (see e.g. [2,4, 133). An expected benefit is the development of correct programs, but, so far, no programming language in current use came from these works. The difficulty is the apparent distance between proofs and programs: the proofs are often complicated and the extracted programs ...
متن کاملMarkov Decision Processes: Discrete Stochastic Dynamic Programming
The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover...
متن کاملDynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is described by an imprecise probability model, which generalises the well-known Bayesian, or precise, models. We compare various optimality criteria that can be associated with such a model, and which coincide in the precis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Statistics
سال: 1974
ISSN: 0007-4993
DOI: 10.5109/13082